Necessary optimality conditions for bilevel set optimization problems
نویسندگان
چکیده
In this work, we use a notion of convexificator [25] together with the support function [3, 4, 15, 16, 41] to establish necessary optimality conditions for set valued bilevel optimization problems. Fortunately, the Lipschitz property of a set-valued mapping is conserved for its support function. An intermediate set-valued optimization problem is introduced to help us in our investigation.
منابع مشابه
Necessary Optimality Conditions for Multiobjective Bilevel Programs
The multiobjective bilevel program is a sequence of two optimization problems, with the upper-level problem being multiobjective and the constraint region of the upper level problem being determined implicitly by the solution set to the lower-level problem. In the case where the Karush-Kuhn-Tucker (KKT) condition is necessary and sufficient for global optimality of all lower-level problems near...
متن کاملNecessary optimality conditions of a D.C. set valued bilevel optimization problem
In this paper, we consider a bilevel vector optimization problem where objective and constraints are set valued maps. Our approach consists of using a support function [1, 2, 3, 14, 15, 32] together with the convex separation principle for the study of necessary optimality conditions for D.C bilevel set valued optimization problems. We give optimality conditions in terms of the strong subdiffer...
متن کاملOptimality Conditions for Optimization Problems with Complementarity Constraints
Optimization problems with complementarity constraints are closely related to optimization problems with variational inequality constraints and bilevel programming problems. In this paper, under mild constraint qualifications, we derive some necessary and sufficient optimality conditions involving the proximal coderivatives. As an illustration of applications, the result is applied to the bilev...
متن کاملNew Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
The bilevel program is a sequence of two optimization problems where the constraint region of the upper level problem is determined implicitly by the solution set to the lower level problem. The classical approach to solving such a problem is to replace the lower level problem by its Karush–Kuhn–Tucker (KKT) condition and solve the resulting mathematical programming problem with equilibrium con...
متن کاملAn Interior Point Technique for Solving Bilevel Programming Problems
This paper deals with bilevel programming programs with convex lower level problems. New necessary and sufficient optimality conditions that involve a single-level mathematical program satisfying the linear independence constraint qualification are introduced. These conditions are solved by an interior point technique for nonlinear programming. Neither the optimality conditions nor the algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 39 شماره
صفحات -
تاریخ انتشار 2007